NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
501	70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Combinatorial optimization NP-complete problems Routing algorithms Search algorithms Matching Randomized algorithm Graph coloring Connectivity Dominating set Mathematics Theoretical computer science Graph theory
502	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
503	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
504	Covering Number for Efficient Heuristic-Based POMDP Planning Zongzhang Zhang ZHANGZZ @ COMP. NUS . EDU . SG David Hsu DYHSU @ COMP. NUS . EDU . SG Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-04 06:57:08 Dynamic programming Partially observable Markov decision process Stochastic control Branch and bound NP-complete problems Statistics Mathematics Theoretical computer science
505	16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Operations research NP-complete problems Search algorithms Analysis of algorithms Boolean satisfiability problem Backtracking Algorithm PP Time complexity Theoretical computer science Applied mathematics Computational complexity theory
506	Real-time Spatial Task Assignment for Weather Crowdsourcing Hien To, Liyue Fan, Luan Tran, Cyrus Shahabi {hto, liyuefan, luantran, shahabi}@usc.edu University of Southern California Add to Reading List Source URL: imsc.usc.edu Language: English - Date: 2015-04-06 12:57:07 HM NP-complete problems Maximum coverage problem Crowdsourcing
507	νZ - An Optimizing SMT Solver Nikolaj Bjørner1 , Anh-Dung Phan2 , and Lars Fleckenstein3 1 Microsoft Research, Redmond, WA, USA DTU Compute, Technical University of Denmark Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2015-01-22 06:10:53 Operations research Constraint programming Electronic design automation Formal methods NP-complete problems Satisfiability Modulo Theories Mathematical optimization Linear programming Boolean satisfiability problem Theoretical computer science Applied mathematics Mathematics
508	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
509	Engineering Theories with Z3? Nikolaj Bjørner Microsoft Research Abstract. Modern Satisfiability Modulo Theories (SMT) solvers are Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-10-17 17:03:30 Formal methods Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories Vehicle Identification Number Theoretical computer science Applied mathematics Electronic design automation
510	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ Joondong Kim∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:57 NP-complete problems Steiner tree problem Minimum spanning tree Eulerian path Matching Graph coloring Tree Connectivity Matroid theory Graph theory Mathematics Theoretical computer science

UPDATE